TT-Miner: Topology-Transaction Miner for Mining Closed Itemset
نویسندگان
چکیده
منابع مشابه
AIM: Another Itemset Miner
We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate a combination of these techniques into an algorithm which utilize those techniques dynamically according to the input dataset. The algorithm main features include depth first search with vertical compressed database, ...
متن کاملAn Efficient Closed Frequent Itemset Miner for the Moa Stream Mining System
We describe and evaluate an implementation of the IncMine algorithm due to Cheng, Ke, and Ng (2008) for mining frequent closed itemsets from data streams, working on the MOA platform. The goal was to produce a robust, efficient, and usable tool for that task that can both be used by practitioners and used for evaluation of research in the area. We experimentally confirm the excellent performanc...
متن کاملComEx Miner: Expert Mining in Virtual Communities
The utilization of Web 2.0 as a platform to comprehend the arduous task of expert identification is an upcoming trend. An open problem is to assess the level of expertise objectively in the web 2.0 communities formed. We propose the “ComEx Miner System” that realizes Expert Mining in Virtual Communities, as a solution for this by quantifying the degree of agreement between the sentiment of blog...
متن کاملAK Miner: An Online Data Mining Tool
The world today is moving faster in the software industry than anywhere else. To keep data mining tools accessible to everyone is a Herculean task. We plan to solve this problem in this paper and tool. AK Miner is an online data mining tool that is easily accessible by anyone with a computer. The one of the advantages of AK Miner over the already preexisting Data mining Tools is that it is not ...
متن کاملX3-Miner: mining patterns from XML database
An XML enabled framework for representation of association rules in databases was first presented in [4]. In Frequent Structure Mining (FSM), one of the popular approaches is to use graph matching that use data structures such as the adjacency matrix [7] or adjacency list [8]. Another approach represents semistructured tree-like structures using a string representation, which is more space effi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2018.2888627